Buscar
Mostrando ítems 1-10 de 3344
A FAST ALGORITHM ON AVERAGE FOR ALL-AGAINST-ALL SEQUENCE MATCHING
(IEEE TECHNICAL COMMITTEE ON DATA ENGINEERING, 1999)
We present an algorithm which attempts to align pairs of
subsequences from a database of genetic sequences. The algorithm
simulates the classical dynamic programming alignment algorithm over a
suffix array of the database. ...
A XOR-based ABC algorithm for solving set covering problems
(Springer Verlag, 2016)
AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
(Siam Publications, 2020-01-01)
We explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The ...
Approximation Algorithms For Sorting By Length-weighted Prefix And Suffix Operations
(ELSEVIER SCIENCE BVAMSTERDAM, 2015)
Fixed-Parameter approximation schemes for weighted flowtime
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)
Given a set of n jobs with integral release dates, processing times and weights, it is a natural and
important scheduling problem to compute a schedule that minimizes the sum of the weighted flow
times of the jobs. There ...
An efficient algorithm for approximated self-similarity joins in metric spaces
(Elsevier, 2020)
Similarity join is a key operation in metric databases. It retrieves all pairs of elements that are similar. Solving such a problem usually requires comparing every pair of objects of the datasets, even when indexing and ...
Approximation and parameterized algorithms for geometric independent set with shrinking
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Consider the Maximum Weight Independent Setproblem for rectangles: given a family ofweighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlappingrectangles. The problem is notoriously hard ...
Approximation algorithms and hardness results for the clique packing problem
(ELSEVIER SCIENCE BV, 2009)
For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural ...
Approximation algorithms for connected graph factors of minimum weight
(Springer, 2018)
Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of ...
Approximation schemes for knapsack problems with shelf divisions
(Elsevier Science BvAmsterdamHolanda, 2006)